N,N'',N"-三(2,6-二异丙基苯胺基)-2,5-二亚胺吡咯的合成及其结构

在多聚磷酸三甲基硅酯(PPSE)的存在下,2,6-二异丙基苯胺和丁二酸缩合可以高产率地得到N,N',N'-三(2,6-二异丙基苯胺基)-2,5-二亚胺吡咯(1).化合物1经过了元素分析、红外光谱、氢谱、高分辨质谱和单晶结构衍射的表征.     

多值逻辑与多值数字运算的光学实现

提出利用光学符号代换法则实现POST代数和GALOIS代数两种基本的多值逻辑函数,并给出了Max(x,y)运算、Min(x,y)运算以及数字加法和乘法运算的实验结果。     

四元Goethals码的对偶码

Abstract. The trace representation of the dual of quaternary Goethals code δ(m) is given . It isproved that the shortened code of δ(m) is cyclic and its generators are shown.     

Digital information encrypted in an image using binary encoding

This paper proposes a new type of encoding methods to encrypt hidden (covert) information in host images. The encrypted information can be plot, fax, word, or network data, and it must be encoded with binary codes. All the pixels in an encoded (overt) image modulated from a host image are classified into three groups. The first group of pixels is called identification codes, used to judge whether the overt image is encoded by a method proposed in this paper or not. The second group of pixels is called type codes, used to judge the encoding type. The third group of pixels is called information codes, used to decode the encoded information. Applying the proposed encoding methods is quite convenient, and host images are not needed for decoding. Decoding covert information from overt images is rather difficult for un-authorized persons, whereas it is very easy for designers or authorized persons. Therefore, the proposed methods are very useful.     

Nonexistence of a code for

In this paper, we shall prove that there is no [3q⁴-q³-q²-3q-1,5,3q⁴-4q³-2q+1]_q code over the finite field for q11. Thus, we conclude the nonexistence of a [g_q(5,d),5,d]_q code for 3q⁴-4q³-2q+1d3q⁴-4q³-q.     

An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex method for linear programming and he proved that his rule is convergent. In this note we show that the required number of iterations may be exponential in the number of variables and constraints of the problem.     

面向天基引力波探测的时间延迟干涉技术

时间延迟干涉技术(Time-delay Interferometry,TDI)对中国引力波探测项目及其它天基激光精密测量任务具有重要的参考价值。在天基引力波探测任务中,需利用激光干涉仪对无拖曳检验质量块间实现十皮米量级的位移测量精度。其中,激光源频率噪声和时钟频率噪声是两项主要噪声。在欧洲主导的LISA(Laser Interferometer Space Antenna)引力波探测项目中,利用TDI对三星上的十二组相位测量值进行延迟和线性组合,构造出臂长相等的干涉仪,从而消除了激光源噪声以及光学平台位移噪声。为了消除时钟噪声,将时钟信号倍频到GHz,再通过相位调制的方式加载到星间激光链路上,最终从时钟边带拍频信号中提取出时钟噪声,并在TDI的数据组合中将时钟噪声项消除。为了实现TDI的时间延迟处理,要求对星间绝对距离进行精确测量。因此,在TDI机制中,星间激光链路需要同时实现位移测量、时钟边带调制和绝对距离测量3个功能。其中,后两个功能分别大约消耗10%和1%的载波激光功率。LISA项目针对TDI技术的地面论证结果表明,TDI技术对激光源和时钟的噪声抑制分别达到了109和5.8×104倍。     

Multiple Observations for Secret-Key Binding with SRAM PUFs

We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF. Performance is improved in comparison to classic schemes which generate helper data based on a single enrollment observation. The performance increase can be explained by the fact that the reliabilities of the different SRAM cells are modeled (implicitly) in the helper data. We prove that the scheme achieves secret-key capacity for any number of enrollment observations, and, therefore, it is optimal. We evaluate performance of the scheme using Monte Carlo simulations, where an off-the-shelf LDPC code is used to implement the linear error-correcting code. Another scheme that models the reliabilities of the SRAM cells is the so-called Soft-Decision (SD) helper data scheme. The SD scheme considers the one-probabilities of the SRAM cells as an input, which in practice are not observable. We present a new strategy for the SD scheme that considers the binary SRAM-PUF observations as an input instead and show that the new strategy is optimal and achieves the same reconstruction performance as the MO scheme. Finally, we present a variation on the MO helper data scheme that updates the helper data sequentially after each successful reconstruction of the key. As a result, the error-correcting performance of the scheme is improved over time.     

Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian–Wolf Codes

Typical random codes (TRCs) in a communication scenario of source coding with side information in the decoder is the main subject of this work. We study the semi-deterministic code ensemble, which is a certain variant of the ordinary random binning code ensemble. In this code ensemble, the relatively small type classes of the source are deterministically partitioned into the available bins in a one-to-one manner. As a consequence, the error probability decreases dramatically. The random binning error exponent and the error exponent of the TRCs are derived and proved to be equal to one another in a few important special cases. We show that the performance under optimal decoding can be attained also by certain universal decoders, e.g., the stochastic likelihood decoder with an empirical entropy metric. Moreover, we discuss the trade-offs between the error exponent and the excess-rate exponent for the typical random semi-deterministic code and characterize its optimal rate function. We show that for any pair of correlated information sources, both error and excess-rate probabilities exponential vanish when the blocklength tends to infinity.     

A Coupling Framework for Multi-Domain Modelling and Multi-Physics Simulations

This paper describes a coupling framework for parallel execution of different solvers for multi-physics and multi-domain simulations with an arbitrary number of adjacent zones connected by different physical or overlapping interfaces. The coupling architecture is based on the execution of several instances of the same coupling code and relies on the use of smart edges (i.e., separate processes) dedicated to managing the exchange of information between two adjacent regions. The collection of solvers and coupling sessions forms a flexible and modular system, where the data exchange is handled by independent servers that are dedicated to a single interface connecting two solvers’ sessions. Accuracy and performance of the strategy is considered for turbomachinery applications involving Conjugate Heat Transfer (CHT) analysis and Sliding Plane (SP) interfaces.